Online Encoding Algorithm for Infinite Set

In this paper we present online encoding and decoding algorithms for an infinite input alphabet. The well-known encoding algorithm that explicitly constructs the optimal codes is proposed by Huffman. This algorithm is clearly inappropriate for online encoding because the whole input data are not known before starting the process. We propose an algorithm that can be encoded while the input data performed in an online mode. Theoretical result shows that the tree obtained from the algorithm satisfies a code length property of an optimal solution. Moreover, experimental results are also shown that the average code length is close to the one resulted from Huffman algorithm and the entropy of input data.